A Seed Placement Strategy for Conforming Voronoi Meshing
نویسندگان
چکیده
We show how to place a set of seed points such that a given piecewise linear complex is the union of some faces in the resulting Voronoi diagram. The seeds are placed on sufficiently small spheres centered at input vertices and are arranged into little circles around each half-edge where every seed is mirrored across the associated triangle. The Voronoi faces common to the seeds of such arrangements yield a mesh conforming to the input complex. If the input contains sharp angles, then additional seeds are needed, analogous to nonobtuse refinement. Finally, we propose local optimizations to reduce the number of seeds and output facets.
منابع مشابه
Sampling Conditions for Conforming Voronoi Meshing by the VoroCrust Algorithm
We study the problem of decomposing a volume with a smooth boundary into a collection of Voronoi cells. Unlike the dual problem of conforming Delaunay meshing, a principled solution to this problem for generic smooth surfaces remained elusive. VoroCrust leverages ideas from weighted α-shapes and the power crust algorithm to produce unweighted Voronoi cells conforming to the surface, yielding th...
متن کاملA Laguerre Voronoi Based Scheme for Meshing Particle Systems.
We present Laguerre Voronoi based subdivision algorithms for the quadrilateral and hexahedral meshing of particle systems within a bounded region in two and three dimensions, respectively. Particles are smooth functions over circular or spherical domains. The algorithm first breaks the bounded region containing the particles into Voronoi cells that are then subsequently decomposed into an initi...
متن کاملConforming Centroidal Voronoi Delaunay Triangulation for Quality Mesh Generation
As the methodology of centroidal Voronoi tessellation (CVT) is receiving more and more attention in the mesh generation community, a clear characterization of the influence of geometric constraints on the CVT-based meshing is becoming increasingly important. In this paper, we first give a precise definition of the geometrically conforming centroidal Voronoi Delaunay triangulation (CfCVDT) and t...
متن کاملSampling Conditions for Clipping-free Voronoi Meshing by the VoroCrust Algorithm
Decomposing the volume bounded by a closed surface using simple cells is a key step in many applications. Although tetrahedral meshing is well-established with several successful implementations, many research questions remain open for polyhedral meshing, which promises significant advantages in some contexts. Unfortunately, current approaches to polyhedral meshing often resort to clipping cell...
متن کاملRecent Progress in Robust and Quality Delaunay Mesh Generation
In this paper, some current issues of Delaunay mesh generation and optimization are addressed, with particular emphasis on the robustness of the meshing procedure and the quality of the resulting mesh. We also report new progress on the robust conforming and constrained boundary recovery in three dimensions, along with the quality mesh generation based on Centroidal Voronoi tessellations. Appli...
متن کامل